t_c = int(input())
while(t_c>0):
num = int(input())
arr = list(map(int,input().split()))
even =0
odd = 0
for i in arr:
if i%2==0:
even = even + 1
else:
odd = odd + 1
print(min(even,odd))
t_c = t_c - 1
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int solve() {
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
int e = 0, o = 0;
for(int i=0; i<n; i++) {
int y; cin >> y;
if(y&1) {
o++;
}
else {
e++;
}
}
int a = max(o, e);
cout << n - a << endl;
}
return 0;
}
int32_t main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |